Theory Links : Applications to Automated Theorem Proving NEIL
نویسنده
چکیده
We develop the notion of theory t;nk, which is a generalization of ordinary link to a set of llterMs that are ~imultaneously unsatisfiable relative to a given set of clauses. We show that theory links may be 'activated' in much the same manner ~s ordinary links when inferencing with respect to the given set of clauses. Several link deletion results are shown to hold for 6heory links, and some examples are presented using first-order theory links.
منابع مشابه
Theory Exploration with Theorema
Automated theorem proving is a well established subject in computer science. The advances made in the algorithmic techniques for automated theorem proving are impressive, see the survey paper [Loveland 1996]. Also, automated theorem proving has found various important applications in computer science. For example, Robinson’s resolution proving method launched a whole new programming paradigm, n...
متن کاملAxiomatizing truth in a finite model
Given a finite model, we build an axiomatic theory such that the propositions provable in this theory are those valid in the model. We sketch applications to automated theorem proving.
متن کاملOn the Fixpoint Theory of Equality and Its Applications
In the current paper we first show that the fixpoint theory of equality is decidable. The motivation behind considering this theory is that second-order quantifier elimination techniques based on a theorem given in [16], when successful, often result in such formulas. This opens many applications, including automated theorem proving, static verification of integrity constraints in databases as ...
متن کاملA Decision Procedure for an Extensional Theory of Arrays
A decision procedure for a theory of arrays is of interest for applications in formal verification, program analysis, and automated theorem-proving. This paper presents a decision procedure for an extensional theory of arrays and proves it correct1.
متن کاملA Logic of Type Relations and its Applications to Relational Databases
A calculus of typed relations subsuming the classical relational database theory is presented. An associated sound and complete deduction mechanism is developed. The formulation is generalized to deal with nondeterministic databases and information relations in the rough set-style. keywords: relational logic, typed relations, relational database, nondeterministic databases, information relation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008